منابع مشابه
Comparing Curried and Uncurried Rewriting
Currying is a transformation of term rewrite systems which may contain symbols of arbitrary arity into systems which contain only nullary symbols, together with a single binary symbol called application. We show that for all term rewrite systems (whether orthogonal or not) the following properties are preserved by this transformation: strong normalization, weak normalization, weak Church-Rosser...
متن کاملConfluence of Curried Term-Rewriting Systems
Reduction Systems Definition An Abstract Reduction System short ARS consists of a set A and a sequence i of binary relations on A labelled by some set I We often drop the label if I is a singleton We write A j P if the ARS A A i i I has the property P Further we write A j P Q i A j P and A j Q An ARS A A has the diamond property A j i It has the Church Rosser property is con uent A j CR i A j G...
متن کاملLETOS - a lightweight execution tool for operational semantics
syntax Curried ADT Uncurried ADT Uncurried ADT + list arity Parsing no no yes (Metal)
متن کاملComparing logics for rewriting: rewriting logic, action calculi and tile logic
The large di*usion of concurrent and distributed systems has spawned in recent years a variety of new formalisms, equipped with features for supporting an easy speci-cation of such systems. The aim of our paper is to analyze three proposals, namely rewriting logic, action calculi and tile logic, chosen among those formalisms designed for the description of rule-based systems. For each of these ...
متن کاملCompiling Curried Functional Languages to .NET
Recent trends in programming language implementation are moving more and more towards “managed” runtime environments. These offer many benefits, including static and dynamic type checking, security, profiling, bounds checking and garbage collection. The Common Language Infrastructure (CLI) is Microsoft’s attempt to define a managed runtime environment. However, since it was designed with more m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1996
ISSN: 0747-7171
DOI: 10.1006/jsco.1996.0002